Faster separation of 1-wheel inequalities by graph products
نویسندگان
چکیده
منابع مشابه
Faster separation of 1-wheel inequalities by graph products
Using graph products we present an O(|V ||E| + |V | log |V |) separation algorithm for the nonsimple 1-wheel inequalities by Cheng and Cunningham (1997) of the stable set polytope, which is faster than their O(|V |) algorithm. There are two ingredients for our algorithm. The main improvement stems from a reduction of separation problem to multiple shortest path problems in an auxillary graph ha...
متن کاملA Faster Exact Separation Algorithm for Blossom Inequalities
In 1982, Padberg and Rao gave a polynomial-time separation algorithm for b-matching polyhedra. The current best known implementations of their separation algorithm run inO(|V ||E| log(|V |/|E|)) time when there are no edge capacities, but in O(|V ||E| log(|V |/|E|)) time when capacities are present. We propose a new exact separation algorithm for the capacitated case which has the same running ...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اول1-perfectly Orientable Graphs and Graph Products
A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex is a clique in G. The class of 1-p.o. graphs forms a common generalization of the classes of chordal and circular arc graphs. Even though 1-p.o. graphs can be recognized in polynomial time, no structural characterization of 1-p.o. graphs is known. In this ...
متن کاملSolvability of Graph Inequalities
We investigate a new type of graph inequality (in the tradition of Cvetković, Simić, and Capobianco) which is based on the subgraph relation and which allows as terms fixed graphs, graph variables with specified vertices, and the operation of identifying vertices. We present a simple graph inequality which does not have a solution, and show that the solvability of inequalities with only one gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.07.027